Method for transmitting data in multiple input multiple output wireless communication system

ABSTRACT

A method for transmitting data in a multiple input multiple output (MIMO) wireless communication system is disclosed. The method for transmitting a signal to a receiver by a transmitter in a multiple input multiple output (MIMO) wireless communication system includes: generating a bit stream having the size of specific bits through channel coding of data; dividing the bit stream into a first bit stream having a first bit size and a second bit stream having a second bit size; allocating the second bit stream having the second bit size to an antenna sequence codeword on the basis of a signal transmission time; and transmitting the first bit stream having the first bit size to the receiver according to an order of antenna pairs indicated by the allocated antenna sequence codeword.

CROSS-REFERENCE TO RELATED APPLICATIONS

Pursuant to 35 U.S.C. §119(a), this application claims the benefit of earlier filing date and right of priority to Korean Patent Application No. 10-2015-0129629, filed on Sep. 14, 2015, the contents of which are hereby incorporated by reference herein in its entire.

BACKGROUND OF THE INVENTION

Field of the Invention

The present invention relates to a wireless communication system, and more particularly to a method for transmitting data in a multiple input multiple output (MIMO) wireless communication system.

Discussion of the Related Art

The present invention relates to a method for transmitting and receiving radio frequency (RF) data, which can provide a more superior BER (Block Error Rate) performance as compared to the SM (Spatial Modulation) scheme for allocating a bit stream to a transmit (Tx) antenna index and the STBC-SM (Space Time Block Coded-Spatial Modulation) scheme in which the STBC scheme is combined with the SM scheme. Prior to describing the present invention, the SM scheme and the STBC-SM scheme will hereinafter be described in detail.

In addition, the present invention modifies a codeword matrix for use in GBD-QOSTBC (Generalized block diagonal quasi-orthogonal space time block code) so that it defines a sequence (composed of an antenna index) capable of being identified by a user equipment (UE) in different ways. GBD-QOSTBC will hereinafter be described in detail.

Assuming that the number of Tx antennas is denoted by M_(T), the (M_(T)×M_(T))-sized GBD-QOSTBC codeword matrix is constructed. The Alamouti codeword corresponding to M_(T)=2 is defined as the matrix A(s_(i),s_(j)) as shown in the following Table 1. The symbols s_(i),s_(j) may be complex symbols (i.e., s_(i),s_(j)εΨ) over signal constellation (Ψ).

$\begin{matrix} {{{A\left( {s_{i},s_{j}} \right)} = \begin{bmatrix} s_{i} & s_{j} \\ {- s_{j}^{*}} & s_{i}^{*} \end{bmatrix}}\left( {{where},{i \in \left\{ {1,3,{{\ldots\mspace{20mu} 2k} - 1}} \right\}},{j \in \left\{ {2,4,{\ldots\mspace{20mu} 2k}} \right\}},{k = {M_{T}/2}}} \right)} & \left\lbrack {{Equation}\mspace{14mu} 1} \right\rbrack \end{matrix}$

In the environment (M_(T)=4) based on Equation 1, the QO-STBC code is represented by the ABBA code as shown in the following equation 2.

$\begin{matrix} {\begin{bmatrix} A & B \\ B & A \end{bmatrix} = \begin{bmatrix} s_{1} & s_{2} & s_{3} & s_{4} \\ {- s_{2}^{*}} & s_{1}^{*} & {- s_{4}^{*}} & s_{3}^{*} \\ s_{3} & s_{4} & s_{1} & s_{2} \\ {- s_{4}^{*}} & s_{3}^{*} & {- s_{2}^{*}} & s_{1}^{*} \end{bmatrix}} & \left\lbrack {{Equation}\mspace{14mu} 2} \right\rbrack \end{matrix}$

In Equation 2, a diversity gain capable of being obtained using the ABBA code is still maintained at the value of 2. Therefore, a phase rotation of the (s₃,s₄) symbol is needed to obtain the diversity gain of 4 corresponding to the number of Tx antennas. The phase-rotated QO-STBC codeword matrix may be defined as shown in the following equation 3.

$\begin{matrix} {C_{4} = {\begin{bmatrix} s_{1} & s_{2} & {\overset{\sim}{s}}_{3} & {\overset{\sim}{s}}_{4} \\ {- s_{2}^{*}} & s_{1}^{*} & {- {\overset{\sim}{s}}_{4}^{*}} & {\overset{\sim}{s}}_{3}^{*} \\ {\overset{\sim}{s}}_{3} & {\overset{\sim}{s}}_{4} & s_{1} & s_{2} \\ {- {\overset{\sim}{s}}_{4}^{*}} & {\overset{\sim}{s}}_{3}^{*} & {- s_{2}^{*}} & s_{1}^{*} \end{bmatrix} = \begin{bmatrix} {A\left( {s_{1},s_{2}} \right)} & {A\left( {{\overset{\sim}{s}}_{3},{\overset{\sim}{s}}_{4}} \right)} \\ {A\left( {{\overset{\sim}{s}}_{3},{\overset{\sim}{s}}_{4}} \right)} & {A\left( {s_{1},s_{2}} \right)} \end{bmatrix}}} & \left\lbrack {{Equation}\mspace{14mu} 3} \right\rbrack \end{matrix}$

In Equations 2 and 3, s₁,s₂,s₃,s₄εΨ may be used, and {tilde over (s)}₃,{tilde over (s)}₄εe^(jθ) ¹ Ψ (where, {tilde over (s)}₃=s₃·e^(jθ) ¹ ,{tilde over (s)}₄=s₄·e^(jθ) ¹ ) may be used. Specifically, in order to modify the Q-OSTBC matrix shown in Equation 3 into a block diagonal matrix (GBD-QOSTBC), a symbol corresponding to an odd index and a symbol corresponding to an even index are defined in different ways in association with the symbols (s₁,s₂εΨ, {tilde over (s)}₃,{tilde over (s)}₄εe^(jθ) ¹ Ψ) located over the signal constellation. That is, the odd index symbol may be defined as

${s_{odd} = \begin{bmatrix} s_{1} & s_{3} & \ldots & s_{{2k} - 1} \end{bmatrix}^{T}},$ and the even index symbol may be defined as

$s_{even} = {\begin{bmatrix} s_{2} & s_{4} & \ldots & s_{2k} \end{bmatrix}^{T}.}$

The following linear operation is applied to the above symbols, so that new symbols may be defined as shown in Equation 4.

$\begin{matrix} {\begin{bmatrix} S_{1} & S_{3} & \ldots & S_{{2k} - 1} \end{bmatrix}^{T} = {{{TDs}_{odd}\begin{bmatrix} S_{2} & S_{4} & \ldots & S_{2k} \end{bmatrix}}^{T} = {TDs}_{even}}} & \left\lbrack {{Equation}\mspace{14mu} 4} \right\rbrack \end{matrix}$

In order to discriminate the signal constellation of the newly defined symbols shown in Equation 4, Γ may be defined. In other words, the symbol of Equation 4 may be defined as S_(j)εΓ.

In Equation 4, 2k symbols may be classified into two sets (or two aggregates) according to the odd and even indexes. In this case, the (k×k) matrix T may be a random Hadamard matrix. A phase rotation matrix D for acquiring a maximum diversity gain may be represented by the following equation 5.

$\begin{matrix} {D = \begin{bmatrix} {\mathbb{e}}^{{j\theta}_{0}} & \; & \; & \; \\ \; & {\mathbb{e}}^{{j\theta}_{1}} & \; & \; \\ \; & \; & \ddots & \; \\ \; & \; & \; & {\mathbb{e}}^{{j\theta}_{k - 1}} \end{bmatrix}} & \left\lbrack {{Equation}\mspace{14mu} 5} \right\rbrack \end{matrix}$

Assuming that the Hadamard matrix

$T = \begin{bmatrix} 1 & 1 \\ 1 & {- 1} \end{bmatrix}$ shown in Equation 4 is used, the equation 3 may be re-defined as a block diagonal matrix as shown in the following equation 6.

4 = [ ⁢ A ⁡ ( s 1 + s ~ 3 , s 2 + s ~ 4 ) 0 0 A ⁡ ( s 1 - s ~ 3 , s 2 - s ~ 4 ) ] =   [ ⁢ S 1 S 2 - S 2 * S 1 * 0 0 S 3 S 4 - S 4 * S 3 * ⁢ ] [ Equation ⁢ ⁢ 6 ]

In Equations 4 and 6, the symbols (s₁,s₂) may be symbols located over the original signal constellation Ψ in which no phase rotation occurs, such that θ₀=0 of the matrix D may be decided. In addition, although the conventional QO-STBC codeword matrix (C₄) shown in Equation 3 is different from the GBD-QOSTBC codeword matrix (

) shown in Equation 6, the conventional QO-STBC codeword matrix (C₄) and the GBD-QOSTBC codeword matrix (

) may have the same average BER performance.

In another example of GBD-QOSTBC, the codeword matrix (C₈) corresponding to M_(T)=8 may be used. In association with a total of 8 Tx symbols, two symbols are combined into one pair, and symbols of different pairs may belong to the signal constellation having rotated in different phases as shown in the following equation 7. s₁,s₂εe^(jθ) ⁰ Ψ, {tilde over (s)}₃,{tilde over (s)}₄εe^(jθ) ¹ Ψ, s ₅,s ₆εe^(jθ) ² Ψ, ŝ₇,ŝ₈εe^(jθ) ³ Ψ  [Equation 7]

In Equation 7, θ₀=0 may be decided. The phase may be determined according to the number of antennas and the modulation order of Tx symbols. Assuming that M_(T)=8 is decided and the BPSK symbol is transmitted,

${\theta_{1} = \frac{\pi}{4}},{\theta_{2} = \frac{2\pi}{4}},{\theta_{3} = \frac{3\pi}{4}}$ may be used. The random Hadamard matrix (T) shown in FIG. 4 may be assumed as shown in the following equation 8.

$\begin{matrix} {T = \begin{bmatrix} 1 & {- 1} & 1 & {- 1} \\ 1 & 1 & {- 1} & {- 1} \\ {- 1} & 1 & 1 & {- 1} \\ 1 & 1 & 1 & 1 \end{bmatrix}} & \left\lbrack {{Equation}\mspace{14mu} 8} \right\rbrack \end{matrix}$

In addition, the codeword matrix (C₈) may be represented as shown in the following equation 9.

$\begin{matrix} {C_{8} = {\left\lbrack \begin{matrix} A_{1} & \; & \; & \; \\ \; & A_{2} & \; & \; \\ \; & \; & A_{3} & \; \\ \; & \; & \; & A_{4} \end{matrix} \right\rbrack = {\quad{{\left\lbrack \begin{matrix} \begin{matrix} S_{1} & S_{2} \\ {- S_{2}^{*}} & S_{1}^{*} \end{matrix} & \; & \; & \; \\ \; & \begin{matrix} S_{3} & S_{4} \\ {- S_{4}^{*}} & S_{3}^{*} \end{matrix} & \; & \; \\ \; & \; & \begin{matrix} S_{5} & S_{6} \\ {- S_{6}^{*}} & S_{5}^{*} \end{matrix} & \; \\ \; & \; & \; & \begin{matrix} S_{7} & S_{8} \\ {- S_{8}^{*}} & S_{7}^{*} \end{matrix} \end{matrix} \right\rbrack A_{1}} = {{A\left( {{s_{1} - {\overset{\sim}{s}}_{3} + {\overset{\_}{s}}_{5} - {\hat{s}}_{7}},{s_{2} - {\overset{\sim}{s}}_{4} + {\overset{\_}{s}}_{6} - {\hat{s}}_{8}}} \right)} = {{{A\left( {S_{1},S_{2}} \right)}A_{2}} = {{A\left( {{s_{1} + {\overset{\sim}{s}}_{3} - {\overset{\_}{s}}_{5} - {\hat{s}}_{7}},{s_{2} + {\overset{\sim}{s}}_{4} - {\overset{\_}{s}}_{6} - {\hat{s}}_{8}}} \right)} = {{{A\left( {S_{3},S_{4}} \right)}A_{3}} = {{A\left( {{{- s_{1}} + {\overset{\sim}{s}}_{3} + {\overset{\_}{s}}_{5} - {\hat{s}}_{7}},{{- s_{2}} + {\overset{\sim}{s}}_{4} + {\overset{\_}{s}}_{6} - {\hat{s}}_{8}}} \right)} = {{{A\left( {S_{5},S_{6}} \right)}A_{4}} = {{A\left( {{s_{1} + {\overset{\sim}{s}}_{3} + {\overset{\_}{s}}_{5} + {\hat{s}}_{7}},{s_{2} + {\overset{\sim}{s}}_{4} + {\overset{\_}{s}}_{6} + {\hat{s}}_{8}}} \right)} = {A\left( {S_{7},S_{8}} \right)}}}}}}}}}}}} & \left\lbrack {{Equation}\mspace{14mu} 9} \right\rbrack \end{matrix}$

The matrix A(s_(i),s_(j)) is defined in Equation 1. Assuming that M_(T)=2k=2^(r) is decided at a random condition denoted by r≧2, the GBD-QOSTBC matrix may be generalized as shown in the following 10.

$\begin{matrix} {C_{2k} = \begin{bmatrix} {A\left( {S_{1},S_{2}} \right)} & \; & \; & \; \\ \; & {A\left( {S_{3},S_{4}} \right)} & \; & \; \\ \; & \; & \ddots & \; \\ \; & \; & \; & {A\left( {S_{{2k} - 1},S_{2k}} \right)} \end{bmatrix}} & \left\lbrack {{Equation}\mspace{14mu} 10} \right\rbrack \end{matrix}$

In the codeword matrix shown in Equation 10, a horizontal axis may denote an antenna index, and a vertical index may denote a timeslot index. In the case of M_(T)=6 in which the number of Tx antennas is not denoted by M_(T)=2k=2^(r), the GBD-QOSTBC codeword matrix may be constructed in association with M_(T)=8. Then, if the last two rows and the last two columns are deleted, the codeword for M_(T)=6 may be constructed.

The SM scheme will hereinafter be described in detail.

In accordance with the SM scheme, binary data is allocated to each Tx antenna index, an antenna corresponding to a bit stream to be transmitted is selected, and the data stream can be transmitted. That is, total amount of information to be transmitted may be the sum of the amount of information allocated to the data stream and the amount of information allocated to the antenna index.

FIG. 1 is a conceptual diagram illustrating the SM scheme. Referring to FIG. 1, it can be recognized that total amount of information to be transmitted is identical to the sum of the amount of information owned by the Tx symbol and the amount of information allocated to the antenna index used to transmit the Tx symbol information. In more detail, assuming that the number of Tx antennas is M_(T), a maximum of log₂M_(T) bits may be allocated to the Tx antenna index. Assuming that the PSK or QAM symbol having the modulation order of M is used, total amount (m) of information capable of being transmitted using the SM scheme may be defined as m=log₂(M_(T))+log₂(M). That is, the total amount (m) of information capable of being represented by bits per channel use may be defined as m=log₂(M_(T))+log₂(M).

For example, assuming that 3 bits are transmitted per channel use, when the number of Tx antennas is set to 2 and the modulation order is set to 4, the SM scheme may be used as shown in the following Table 1. In Table 1, M_(T)=N_(t) is set, the number of antennas is an antenna index, and the Tx symbol is an M-PSK or M-QAM symbol.

TABLE 1 N₁ = 2, M = 4 N₁ = 4, M = 2 Input Antenna Transmit Antenna Transmit bits number symbol number symbol 000 1 +1 + j 1 −1 001 1 −1 + j 1 +1 010 1 −1 − j 2 −1 011 1 +1 − j 2 +1 100 2 +1 + j 3 −1 101 2 −1 + j 3 +1 110 2 −1 − j 4 −1 111 2 +1 − j 4 +1

The STBC-SM scheme will hereinafter be described in detail.

It is assumed that the (L×L) STBC codeword is based on L Tx antennas from among a total number (M_(T)) of Tx antennas. Whereas the SM scheme allocates the bit stream to each antenna index, L selected antennas must be continuously used during a timeslot of the STBC codeword length (L) when data is transmitted according to the STBC-SM scheme.

The amount of information (represented by the number of bits per channel use) capable of being loaded on the antenna index and then transmitted may be denoted by

$\frac{1}{L}{\left\lfloor {\log_{2}\begin{pmatrix} M_{T} \\ L \end{pmatrix}} \right\rfloor.}$ Therefore, the total amount (m) of information, which is loaded on the Tx symbol (M-PSK or M-QAM) and the antenna index and then transmitted, may be defined as

$m = {{\frac{1}{L}\left\lfloor {\log_{2}\begin{pmatrix} M_{T} \\ L \end{pmatrix}} \right\rfloor} + {{\log_{2}(M)}.}}$

For convenience of description, it is assumed that

${M_{T} = 4},{L = 2},{\left\lfloor {\log_{2}\begin{pmatrix} M_{T} \\ L \end{pmatrix}} \right\rfloor = {\left\lfloor \begin{matrix} \log_{2} & 6 \end{matrix} \right\rfloor = 2}},{{{and}\mspace{14mu} M} = {2({BPSK})}}$ may be used.

2 Tx antennas from among four Tx antennas are selected, and data is transmitted using the Alamouti method during 2 timeslots. 2 Tx antenna indexes are selected from among 4 Tx antenna indexes (1˜4), and 2 bits are allocated as shown in the following Table 2. The STBC-SM codeword corresponding to the selected antenna is shown in the following equation 11. In Equation 11, a vertical axis may denote an antenna index, and a horizontal axis may denote a timeslot index.

TABLE 2 Selected antenna Allocated indexes bits (1, 2) 00 (3, 4) 01 (2, 3) 10 (1, 4) 11

$\begin{matrix} \; & \left\lbrack {{Equation}\mspace{14mu} 11} \right\rbrack \\ \begin{matrix} {\chi_{1} = {\left\{ {X_{11},X_{12}} \right\} = \left\{ {\begin{pmatrix} x_{1} & x_{2} & 0 & 0 \\ {- x_{2}^{*}} & x_{1}^{*} & 0 & 0 \end{pmatrix},\begin{pmatrix} 0 & 0 & x_{1} & x_{2} \\ 0 & 0 & {- x_{2}^{*}} & x_{1}^{*} \end{pmatrix}} \right\}}} \\ {\chi_{2} = {\left\{ {X_{21},X_{22}} \right\} = {\left\{ {\begin{pmatrix} 0 & x_{1} & x_{2} & 0 \\ 0 & {- x_{2}^{*}} & x_{1}^{*} & 0 \end{pmatrix},\begin{pmatrix} x_{2} & 0 & 0 & x_{1} \\ x_{1}^{*} & 0 & 0 & {- x_{2}^{*}} \end{pmatrix}} \right\}{\mathbb{e}}^{j\theta}}}} \end{matrix} & \; \end{matrix}$

In Equation 11, it can be recognized that all codeword elements of the codebook χ₂ are phase-rotated by θ, such that the distance between symbols defined in two codebooks is maximized, resulting in improved BER performance. The value (θ) may be changed according to the number of Tx antennas and the modulation order, and it is impossible to search for the value (θ) using the closed Form, such that the value (θ) must be experimentally searched for. A detailed description thereof will hereinafter be described with reference to the attached drawings.

FIG. 2 is a conceptual diagram illustrating the STBC-SM scheme. For convenience of description, it is assumed that θ=π/2 is decided as shown in FIG. 2.

x₁,x₂ may denote BPSK symbols transmitted from respective antennas. Therefore, during two timeslots, one bit is additionally transmitted to each antenna so that a total of 2 bits may be transmitted to the respective antennas. In addition, 2 bits are additionally transmitted to the antenna index, such that a total of 4 bits can be transmitted. In this case, the 4-bit streams may be denoted by u₁,u₂,u₃,u₄ as shown in FIG. 2. Assuming that u₁,u₂ indicates a bit stream allocated to the antenna index and u₃,u₄ indicates a bit stream allocated to the BPSK symbol and then transmitted, a block diagram shown in FIG. 2 may be acquired.

In the meantime, under the condition that a channel is unchanged during only the timeslot (L<M_(T)), if it is assumed that L Tx antennas are selected from among M_(T) Tx antennas and data is then transmitted at a fixed transfer rate, the STBC-DM scheme transmits some parts of the total amount of Tx data using the SM scheme. As a result, the amount of information, which is located on the Tx symbol and then transmitted, can be greatly reduced as compared to the method for transmitting data using the conventional (L×L)-sized STBC codeword, resulting in acquisition of a BER gain.

SUMMARY OF THE INVENTION

Accordingly, the present invention is directed to a method for transmitting data in a MIMO wireless communication system that substantially obviates one or more problems due to limitations and disadvantages of the related art.

An object of the present invention is to provide a method for transmitting data in a MIMO wireless communication system. Specifically, the present invention proposes a method for effectively transmitting and receiving RF data in an open-loop MIMO system.

Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention may be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.

To achieve these objects and other advantages and in accordance with the purpose of the invention, as embodied and broadly described herein, a method for transmitting a signal to a receiver by a transmitter in a multiple input multiple output (MIMO) wireless communication system includes: generating a bit stream having the size of specific bits through channel coding of data; dividing the bit stream into a first bit stream having a first bit size and a second bit stream having a second bit size; allocating the second bit stream having the second bit size to an antenna sequence codeword on the basis of a signal transmission time; and transmitting the first bit stream having the first bit size to the receiver according to an order of antenna pairs indicated by the allocated antenna sequence codeword.

The antenna sequence codeword may be defined by 2 timeslots and 2 antenna indexes.

The transmitting the first bit stream having the first bit size may include: transmitting the first bit stream having the first bit size using QO (quasi-orthogonal)-STBC (space time block code), according to the order of antenna pairs indicated by the allocated antenna sequence codeword, on a timeslot basis. The allocated antenna sequence codeword may indicate a pair of antennas needed to transmit data during 2 timeslots.

The sum of the first bit size and the second bit size may be identical to the specific bit size.

It is to be understood that both the foregoing general description and the following detailed description of the present invention are exemplary and explanatory and are intended to provide further explanation of the invention as claimed.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the principle of the invention. In the drawings:

FIG. 1 is a conceptual diagram illustrating the SM scheme.

FIG. 2 is a conceptual diagram illustrating the STBC-SM scheme.

FIG. 3 is a conceptual diagram illustrating a method for generating an antenna index sequence according to an embodiment of the present invention.

FIG. 4 illustrates the relationship between the number of antennas and the maximum amount of information when the antenna index sequence is used according to an embodiment of the present invention.

FIG. 5 is a block diagram illustrating a transmitter according to an embodiment of the present invention.

FIG. 6 is a block diagram illustrating a receiver according to an embodiment of the present invention.

FIG. 7 is a block diagram illustrating a receiver according to another embodiment of the present invention.

DESCRIPTION OF SPECIFIC EMBODIMENTS

In order to increase the frequency efficiency per cell, a large amount of information must be allocated to each Tx symbol, such that there is a need to transmit the symbol having a high modulation level. However, when the high-modulation-level symbol is transmitted, the minimum distance between the above symbols over the signal constellation is gradually reduced, such that a BER performance may be deteriorated at the same SNR. The closed loop MIMO system in which a base station (BS) can utilize channel information between the transmitter and the receiver increases a valid reception (Rx) SNR using the MIMO beamforming scheme, such that it can directly increase the Achievable Rate (AR).

However, the Rx SNR gain (array gain) of the open loop MIMO system is determined by the number of Rx antennas, such that the Rx SNR gain (array gain) is decided by the number of Rx antennas. As a result, although many antennas of the BS are present, it may be difficult to directly increase the transfer rate in so far as Tx power is not amplified. When the open loop MIMO system transmits the same amount of data, the present invention does not improve the transfer rate due to the increased Rx SNR, but increases the BER performance when the same amount of data is transmitted in the open loop MIMO system, as compared to the legacy open loop MIMO data Tx/Rx methods.

The present invention is characterized in that the GBD-QOSTBC codeword matrix is modified into another within only the limitation condition in which a diversity gain is maintained, from the standpoint of the BER performance of the QO-STBC scheme. Such codeword modification may be identical to that of the method for changing an antenna to be used according to a data transmission time, and a sequence composed of the Tx antenna index is defined, such that the sequence may be used to transmit data. As a result, the total amount of data to be transmitted may be divided into the Tx symbol and the antenna index sequence and then transmitted. The above-mentioned data transmission scheme of the present invention will hereinafter be referred to as STBC-SSC (Space Time Block Coded Spatial Sequence Coding). The codebook according to the embodiment of the present invention will hereinafter be described.

A) Codebook Definition

(1) χ_(QAM,QOSTBC): QO-STBC Symbol Vector Codebook (Comprised of M-PSK and M-QAM Symbols)

The QO-STBC symbol vector codebook is used to construct the (M_(T)×M_(T)) codeword matrix based on the legacy QO-STBC scheme. In accordance with the proposed scheme, the QO-STBC symbol vector codebook may be used for GBD-QOSTBC symbol transformation (or conversion). The QO-STBC codeword may be acquired by extending the 2×2 Alamouti codeword (Orthogonal STBC) to the (M_(T)×M_(T)) matrix based on the ABBA codeword in association with M_(T)=2²,2³, . . . ,2^(r). Accordingly, the QO-STBC codeword matrix may have half-orthogonal characteristics. That is, each row vector (or each column vector) constructing the QO-STBC codeword matrix may be perpendicular to M_(T)/2 different row vectors (column vectors). In order to easily the above-mentioned characteristics, C₄ ^(H)C₄ may be represented by the following equation 12 using the QO-STBC codeword shown in Equation 3.

$\begin{matrix} {{C_{4}^{H}C_{4}} = \begin{bmatrix} c & 0 & d & 0 \\ 0 & c & 0 & d \\ d & 0 & c & 0 \\ 0 & d & 0 & c \end{bmatrix}} & \left\lbrack {{Equation}\mspace{14mu} 12} \right\rbrack \end{matrix}$

In Equation 12,

$c = {{s_{1}}^{2} + {s_{2}}^{2} + {{\overset{\sim}{s}}_{3}}^{2} + {{\overset{\sim}{s}}_{4}}^{2}}$ and d=s₁{tilde over (s)}₃+{tilde over (s)}₃s*₁−s₂{tilde over (s)}*₄−{tilde over (s)}₄s*₂ may be used. In addition, it can be recognized that the pair of symbols to be joint-ML decoded is composed of (s₁,s₃),(s₂,s₄) as can be seen from Equation 12. If the scope of the present invention is extended for a random value (M_(T)), each of two pairs composed of M_(T)/2 symbols needs to be joint-ML decoded.

In conclusion, the χ_(QAM,QOSTBC) codebook may be comprised of the codeword vector, the size of which is M_(T)/2×1. Elements of the vector may be symbols, for example, M-PSK, M-QAM, etc. The elements of the vector are composed of a total of M^(M) ^(T) ^(/2) vectors, as represented by the following equation 13.

                                [Equation  13] $\begin{matrix} {\chi_{{QAM},{QOSTBC}} = \left\{ {\begin{bmatrix} {s_{1}\lbrack 1\rbrack} \\ \vdots \\ {s_{M_{T}/2}\lbrack 1\rbrack} \end{bmatrix},\begin{bmatrix} {s_{1}\lbrack 2\rbrack} \\ \vdots \\ {s_{M_{T}/2}\lbrack 2\rbrack} \end{bmatrix},\ldots\mspace{14mu},\begin{bmatrix} {s_{1}\left\lbrack M^{M_{T}/2} \right\rbrack} \\ \vdots \\ {s_{M_{T}/2}\left\lbrack M^{M_{T}/2} \right\rbrack} \end{bmatrix}} \right\}} \\ {= \left\{ {{s\lbrack 1\rbrack},{s\lbrack 2\rbrack},\ldots\mspace{14mu},{s\left\lbrack M^{M_{T}/2} \right\rbrack}} \right\}} \end{matrix}$

In Equation 13,

s_(n)[k] ∈ Ψ may be used, where kε{1,2, . . . M^(M) ^(T) ^(/2)},nε{1,2, . . . ,M_(T)/2}.

(2) χ_(G-STBC): GBD-QOSTBC Symbol Vector Codebook

By means of the above equation 4, the codeword vectors of χ_(QAM,QOSTBC) defined as the QAM or PSK symbol may be converted into the GBD-QOSTBC symbols as shown in the following equation 14.

$\begin{matrix} {\begin{matrix} \begin{matrix} {{\chi_{G - {STBC}} = \left\{ {{{TDs}\lbrack 1\rbrack},{{TDs}\lbrack 2\rbrack},\ldots\mspace{14mu},{{TDs}\left\lbrack M^{M_{T}/2} \right\rbrack}} \right\}},} \\ {{{where}\mspace{14mu}{s\lbrack k\rbrack}} \in \chi_{{QAM},{QOSTBC}}} \\ {= \left\{ {{S\lbrack 1\rbrack},{S\lbrack 2\rbrack},\ldots\mspace{14mu},{S\left\lbrack M^{M_{T}/2} \right\rbrack}} \right\}} \\ {= \left\{ {\begin{bmatrix} {S_{1}\lbrack 1\rbrack} \\ \vdots \\ {S_{M_{T}/2}\lbrack 1\rbrack} \end{bmatrix},\begin{bmatrix} {S_{1}\lbrack 2\rbrack} \\ \vdots \\ {S_{M_{T}/2}\lbrack 2\rbrack} \end{bmatrix},\ldots\mspace{14mu},\begin{bmatrix} {S_{1}\left\lbrack M^{M_{T}/2} \right\rbrack} \\ \vdots \\ {S_{M_{T}/2}\left\lbrack M^{M_{T}/2} \right\rbrack} \end{bmatrix}} \right\}} \end{matrix} & \; \end{matrix}} & \left\lbrack {{Equation}\mspace{14mu} 14} \right\rbrack \end{matrix}$

Equation 14 may be understood as one-to-one mapping (1:1 mapping) between the codeword vectors as shown in the following equation 15.

$\begin{matrix} \begin{matrix} \left. {s\lbrack 1\rbrack}\rightarrow{S\lbrack 1\rbrack} \right. \\ \left. {s\lbrack 2\rbrack}\rightarrow{S\lbrack 2\rbrack} \right. \\ \vdots \\ \left. {s\left\lbrack M^{M_{T}/2} \right\rbrack}\rightarrow{S\left\lbrack M^{M_{T}/2} \right\rbrack} \right. \end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 15} \right\rbrack \end{matrix}$

Referring to Equations 14 and 15, since mapping is achieved on a vector basis, the codeword vector of χ_(G-STBC) located nearest to the Rx signal vector is decided, and the symbol vector composed of the QAM symbol of χ_(QAM,QOSTBC) is detected through the inverse operation. Symbols used in Equation 14 are summarized as follows.

-   -   S[k]: M_(T)/2×1-sized codeword vector     -   S_(j)[k]: elements of the vector S[k], jε{1,2, . . . M_(T)/2}     -   S_(j)[k]εΓ

(3) χ_(Ant): Antenna Index Sequence Codebook

2 consecutive timeslots may be denoted by one unit as represented by t=(1,2), (3,4), . . . , (M_(T)−1,M_(T)) and an antenna index to be used in response to the transmission (Tx) time may be defined. That is, two antenna indexes to be used in 2 consecutive timeslots may be defined. Two antennas may be combined into one pair so that the two antennas may serve as one symbol constructing the antenna index sequence. Therefore, M_(T)/ 2 antenna pairs may construct one sequence, and the set of different antenna index sequences is denoted by χ_(Ant). The antenna sequence codebook χ_(Ant) may be represented by the following equation 16.

$\begin{matrix} {\chi_{Ant} = \left\{ {I_{j},u_{j},{{{where}\mspace{14mu} j} \in \left\{ {1,2,{\ldots\mspace{14mu}{m2}^{B_{SSC}}}} \right\}}} \right\}} & \left\lbrack {{Equation}\mspace{14mu} 16} \right\rbrack \end{matrix}$

In Equation 16, B_(SSC) is the amount of information allocated to the antenna index sequence and then transmitted, and is represented on a bit basis. In addition, I_(j) is the j-th antenna index sequence, and u_(j) is a bit sequence corresponding to I_(j). In more detail, I_(j) and u_(j) may be represented by the following equation 17.

$\begin{matrix} {{I_{j} = \left( {l_{1},l_{2}} \right)},\left( {l_{3},I_{4}} \right),\ldots\mspace{14mu},\left( {l_{M_{T} - 1},l_{M_{T}}} \right),} & \left\lbrack {{Equation}\mspace{14mu} 17} \right\rbrack \\ {u_{j} = \left\lbrack {u_{1},u_{2},u_{3},\ldots\mspace{14mu},u_{B_{SSC}}} \right\rbrack} & \; \\ {{l_{i} \neq l_{j}},{\forall i},} & \; \\ {{\forall{j \in \left\{ {1,2,\ldots\mspace{11mu},2^{B_{SSC}}} \right\}}},} & \; \\ {{u_{b} \in \left\{ {0,1} \right\}},} & \; \\ {b \in \left\{ {1,\ldots\mspace{14mu},B_{SSC}} \right\}} & \; \\ {{u_{i} \neq u_{j}},} & \; \\ {{\forall i},{\forall{j \in {\left\{ {1,2,\ldots\mspace{14mu},2^{B_{SSC}}} \right\}.}}}} & \; \end{matrix}$

(4) χ_(H): The Set of Effective Channel Matrices

χ_(H) is the set of (M_(T)×M_(T))-sized effective channel matrices corresponding to the antenna index sequence defined in the codebook χ_(Ant). This information is owned by only the open loop MIMO system, and may be represented by the following equation 18.

$\begin{matrix} {\chi_{H}} & \left\lbrack {{Equation}\mspace{14mu} 18} \right\rbrack \end{matrix}$

In Equation 18, B_(SSC) is the amount of information allocated to the antenna index sequence in the same manner as described above. The matrix

may be decided by I_(j) of χ_(Ant). Assuming that data is transmitted using the j-th antenna sequence and the pair of Tx antennas used in 2 timeslots (t₀, t₀+1) is denoted by (m₁,m₂), four elements of the effective channel

corresponding to (m₁,m₂) may be represented by the following expression.

[Expression]

(m ₁ ,t ₀)=h(m ₁)

(m ₁ ,t ₀+1)=h(m ₂)

(m ₂ ,t ₀)=−h(m ₁)*

(m ₂ ,t ₀+1)=h(m ₂)*

In the above expression,

$h = \begin{bmatrix} h_{1} & h_{2} & \ldots & h_{M_{T}} \end{bmatrix}$ may be used, and h(m₂) is the m₂-th element of the vector (h), where a subscript ‘*’ may denote a conjugate complex number. It is assumed that respective elements may be independently from each other, and may have the same independent and identically distributed Gaussian elements, and different vector channels may be independent of each other.

For example, if it is assumed that the antenna indexes sequentially used in the time slots (1,2), (3,4), (5,6), (7,8) are (1,3), (2,4), (5,7), (6,8), the matrix

may be represented by the following equation 19.

j = [ h 1 h 3 0 0 0 0 0 h 2 h 4 ⋮ - h 3 * h 1 * 0 0 ⋮ ⋮ 0 0 - h 4 * h 2 * 0 0 ⋮ ⋮ 0 0 h 5 h 7 * 0 0 h 6 h 8 - h 7 * h 5 * 0 0 0 0 - h 8 * h 6 * ] [ Equation ⁢ ⁢ 19 ]

B) Antenna Index Sequence Generation

In accordance with the present invention, a maximum space time diversity gain provided from the GBD-QOSTBC scheme is maintained, and at the same time the GBD-QOSTBC codeword matrix formed in a block diagonal matrix shape may be modified. A detailed description thereof will hereinafter be described with reference to the attached drawings.

FIG. 3 is a conceptual diagram illustrating a method for generating an antenna index sequence according to an embodiment of the present invention.

Referring to FIG. 3, two antennas used in two consecutive timeslots may be used as one symbol constructing the sequence, and the GBD-QOSTBC codeword matrix may be modified in units of a column vector as shown in FIG. 3. In FIG. 3, the left GBD-QOSTBC codeword matrix may be denoted by C_(2k), and the right modified GBD-QOSTBC codeword matrix may be denoted by

.

In this case, although

is not configured in a block diagonal matrix shape,

matrix may still be a diagonal matrix. In addition, C_(2k) ^(H)C_(2k) and

do not correspond to the same diagonal matrix, and the same principles may also be applied to the effective channel matrix corresponding to

. Therefore, user equipments (UEs) may be identified by different kinds of information.

A maximum number of sequences capable of being generated by modification of the M_(T)×M_(T) GBD-QOSTBC matrix may be the number of cases achieved when every 2 Tx antennas from among a total of M_(T) Tx antennas are selected a total of M_(T)/2 times without duplication, and may be represented by the following equation 20. N _(Max)=_(M) _(T) C ₂×_(M) _(T) ₋₂ C ₂× . . . ×₄ C ₂  [Equation 20]

In this way, a maximum amount of information capable of being allocated to the antenna sequence index may be represented by the following equation 21.

$\begin{matrix} \begin{matrix} {B_{SSC} = {\frac{1}{M_{T}}{\log_{2}\left( \frac{M_{T}!}{2^{M_{T}/2}} \right)}\mspace{14mu}\left( {{bits}\text{/}{channel}\mspace{14mu}{use}} \right)}} \\ {= {{\frac{1}{M_{T}}{\log_{2}\left( {M_{T}!} \right)}} - \frac{1}{2}}} \\ {\approx {{\log_{2}\left( M_{T} \right)} + \underset{\underset{(\alpha)}{︸}}{\frac{1}{M_{T}\ln\; 2} + {\frac{1}{2\; M_{T}}{\log_{2}\left( M_{T} \right)}}} -}} \\ {\underset{\underset{(\beta)}{︸}}{\left( {\frac{1}{\ln\; 2} + \frac{1}{2}} \right)} \geq {{\log_{2}\left( M_{T} \right)} - 2}} \end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 21} \right\rbrack \end{matrix}$

In Equation 12, if M_(T) is at a very high value, (α)→0 may be decided, (β) is a constant (or an invariable number) that always be less than 2. Therefore, when many Tx antennas are present, B_(SSC) may be represented by Equation 21. In addition, as the number of antennas increases as shown in the graph of FIG. 4, a maximum amount of information may increase in proportion to the logarithmic function as shown in Equation 21.

C) Transmission/Reception (Tx/Rx) Procedures of the STBC-SSC Based Signal

First of all, it is assumed that the transmitter and the receiver may have the codebooks (1) to (3), and the receiver further includes the codebook (4) through channel estimation.

FIG. 5 is a block diagram illustrating a transmitter according to an embodiment of the present invention.

Referring to FIG. 5, data to be transmitted may be channel-encoded, such that the encoded bit stream (i.e., the codeword) may occur. For convenience of description, it is assumed that one codeword is used and a total number of bits is denoted by N=B_(QOSTBC)+B_(SSC). In this case, B_(QOSTBC) bits from among a total of N bits may be transmitted using the QO-STBC scheme, and B_(SSC) bits may be allocated to the antenna sequence and then transmitted. A reference for dividing the encoded bit stream corresponding to the length of N into two portions must be recognized by both the transmitter and the receiver in order to implement the encoding and decoding processes.

2^(B) ^(SSC) bit streams, each of which has the length of B_(SSC), may be allocated to a total of 2^(B) ^(SSC) antenna sequences. Information regarding the bit stream allocated to each antenna sequence has already been defined in the codebook χ_(Ant). In addition, as can be seen from the following equation 22, specific information indicating which one of antenna index sequences will be used by the bit stream to be transmitted may be decided according to a data transmission (Tx) time.

$\begin{matrix} {u_{j} = \left. \left\lbrack {u_{1},u_{2},u_{3},\ldots\mspace{14mu},u_{B_{SSC}}} \right\rbrack\rightarrow I_{j} \right.} & \left\lbrack {{Equation}\mspace{14mu} 22} \right\rbrack \end{matrix}$

If the antenna index sequence codeword is decided, the order of antenna pairs to be used in the timeslot pair (t₁,t₂)=(1, 2), . . . ,(M_(T)−1,M_(T)) may be used. The GBD-QOSTBC symbols S₁,S₂, . . . ,S_(M) _(T) may be transmitted according to the decided order.

The operations of the receiver configured to reconstruct the transmitted data will hereinafter be described. FIG. 6 is a block diagram illustrating a receiver according to an embodiment of the present invention. In FIG. 6,

$y = \begin{bmatrix} y_{1} & y_{2}^{*} & y_{3} & \ldots & y_{M_{T}}^{*} \end{bmatrix}^{T}$ may denote the Rx signal vector received during the M_(T) timeslot.

Referring to FIG. 6, the receiver may search for the codeword indexes of the codebooks (χ_(QAM,QOSTBC), χ_(G-STBC), χ_(H), χ_(Ant)) through decoding. The overall decoding order is as follows. The concept of FIG. 6 is based on the Joint ML (maximum likelihood) scheme capable of simultaneously searching for the antenna sequence (χ_(Ant)) and the symbol (χ_(G-STBC)). A method for searching for the χ_(Ant) symbol will first be described, and a method for searching for the χ_(G-STBC) symbol will be described later.

(a) Joint-ML decoding

The receiver may perform Joint-ML decoding using the effective channel codebook (χ_(H)) in which the GBD-QOSTBC codebook (χ_(G-STBC)) and the antenna index sequence are reflected. From among the effective channel matrices defined in the codebook χ_(H)={

,

, . . . ,

}, if a conjugate transpose matrix of the j-th matrix is multiplied by the Rx signal vector, the multiplication result is represented by the following equation 23.

y ~ j = j H ⁡ [ y 1 y 2 * y 3 ⋮ y 8 * ] , where ⁢ ⁢ j ∈ { 1 , 2 , … ⁢ , 2 B SSC } [ Equation ⁢ ⁢ 23 ]

First elements corresponding to the odd indexes and second elements corresponding to the even indexes of the vector ({tilde over (y)}_(j)) of Equation 23 are distinguished from one another so that the first and second elements are divided into two vectors ({tilde over (y)}_(j) ^(Even),{tilde over (y)}_(j) ^(Odd)). {tilde over (y)}_(j) ^(Even),{tilde over (y)}_(j) ^(Odd) may be defined as shown in the following equation 24.

$\begin{matrix} {{{\overset{\sim}{y}}_{j}^{Even} = \begin{bmatrix} {\overset{\sim}{y}}_{j,2} \\ {\overset{\sim}{y}}_{j,4} \\ \vdots \\ \vdots \\ {\overset{\sim}{y}}_{j,M_{T}} \end{bmatrix}},{{\overset{\sim}{y}}_{j}^{Odd} = \begin{bmatrix} {\overset{\sim}{y}}_{j,1} \\ {\overset{\sim}{y}}_{j,3} \\ \vdots \\ \vdots \\ {\overset{\sim}{y}}_{j,{M_{T} - 1}} \end{bmatrix}}} & \left\lbrack {{Equation}\mspace{14mu} 24} \right\rbrack \end{matrix}$

Assuming that data is transmitted according to the j-th antenna index sequence, the GBD-QOSTBC codeword located nearest to the Rx signal vector is searched for in χ_(G-STBC). In this case, although it is assumed that the distance measurement method for searching for the nearest codeword vector is l₂-norm, it may be possible to use other measurement methods as necessary. In association with two symbol vectors ({tilde over (y)}_(j) ^(Even),{tilde over (y)}_(j) ^(Odd)), the k-th codeword vector of the codebook χ_(G-STBC) can be represented by the following equation 25, and the l₂-norm value may be represented by the following equation 26.

$\begin{matrix} {d_{Even}^{\lbrack{k,j}\rbrack} = {\min\limits_{\forall k}{{{\overset{\sim}{y}}_{j}^{Even} - {\begin{bmatrix} a_{j} & \; & \; & \; \\ \; & {\; b_{j}} & \; & \; \\ \; & \; & c_{j} & \; \\ \; & \; & \; & d_{j} \end{bmatrix}{S\lbrack k\rbrack}}}}_{2}}} & \left\lbrack {{Equation}\mspace{14mu} 25} \right\rbrack \end{matrix}$

$\begin{matrix} {d_{Odd}^{\lbrack{k,j}\rbrack} = {\min\limits_{\forall k}{{{\overset{\sim}{y}}_{j}^{Odd} - {\begin{bmatrix} a_{j} & \; & \; & \; \\ \; & {\; b_{j}} & \; & \; \\ \; & \; & c_{j} & \; \\ \; & \; & \; & d_{j} \end{bmatrix}{S\lbrack k\rbrack}}}}_{2}}} & \left\lbrack {{Equation}\mspace{14mu} 26} \right\rbrack \end{matrix}$

In Equations 25 and 26, S[k]εχ_(G-STBC) may be used, and a_(j),b_(j),c_(j),d_(j) may be derived from the following equation 27.

j H ⁢ j = [ a j ⁢ I 2 b j ⁢ I 2 ⁢ c j ⁢ I 2 d j ⁢ I 2 ] , where ⁢ ⁢ I 2 = [ 1 0 0 1 ] [ Equation ⁢ ⁢ 27 ]

In addition, in association with the j-th codeword matrix of χ_(H), Equation 25 and Equation 26 can be calculated in consideration of all codeword vectors (s[k],∀kε{1,2, . . . ,M^(M) ^(T) ^(/2)}) of χ_(G-STBC). In association with all codeword matrices of χ_(H), the above-mentioned processes are repeatedly performed as denoted by (

,∀jε{1,2, . . . ,2^(B) ^(SSC) }), d_(Odd) ^([k,j]) and d_(Even) ^([k,j]) values may be searched for in all values (k, j). Thereafter, the antenna sequence index and the GBD-QOSTBC codeword index may be decided by the following equation 28 according to the following reference based on the calculated value.

$\begin{matrix} {\left( {k^{*},j^{*}} \right) = {\min\limits_{{\forall k},{\forall j}}\left( {d_{Even}^{\lbrack{k,j}\rbrack} + d_{odd}^{\lbrack{k,j}\rbrack}} \right)}} & \left\lbrack {{Equation}\mspace{14mu} 28} \right\rbrack \end{matrix}$

In Equation 28, k* is a codeword vector index of the codebook χ_(G-STBC), and j* is a codeword matrix index of the codebook χ_(Ant).

(b) As can be seen from Equation 29, the symbol vector χ_(QAM,QOSTBC) may be searched for through the inverse operation of Equation 14.

$\begin{matrix} {{\hat{s} = {s\left\lbrack k^{*} \right\rbrack}},{{{where}\mspace{14mu}{s\left\lbrack k^{*} \right\rbrack}} \in \chi_{{QAM},{QOSTBC}}}} & \left\lbrack {{Equation}\mspace{14mu} 29} \right\rbrack \end{matrix}$

(c) Not only through the decision of the Tx symbol such as QAM/PSK or the like, but also through the demodulation of the decided symbol, binary data can be extracted.

(d) The bit stream allocated to the decided j*-th antenna sequence may be extracted from the codebook χ_(Ant).

(e) The encoded bit stream formed by adding the binary data extracted from the above methods (c) and (d) to one bit stream may be constructed, and the resultant encoded bit stream is decoded so that an original signal (binary data) is reconstructed.

An example of the STBC-SSC signal transmission method will hereinafter be given on the basis of the above-mentioned description. First of all, 8 bits may be transmitted according to the QO-STBC scheme (i.e., 8 bits may be respectively transmitted through 8 antennas). It is assumed that 2-bit data is transmitted using SSC, such that the following definition may be achieved.

-   -   8×8 GBD-QOSTBC, M_(T)=8     -   B_(STBC)=8 bits and B_(SSC)=2 bits     -   Constellation: BPSK (M=2)

In addition, the internal parameters (T,D) according to the system environment may be defined as follows.

-   -   D=diag{e^(jθ) ⁰ ,e^(jθ) ¹ ,e^(jθ) ² ,e^(jθ) ³ },     -   If 8 antennas are used and BPSK is then used, phases needed for         acquiring a maximum space time diversity of GBD-QOSTBC are         denoted by

$\begin{matrix} {{\theta_{0} = 0},} \\ {\theta_{1} = \frac{\pi}{4}} \\ {{\theta_{2} = \frac{\pi}{2}},} \\ {\theta_{3} = {\frac{3\pi}{4}.}} \end{matrix}$

-   -   It is assumed that Hadamard matrix is denoted by

$\mspace{14mu}{T = {\begin{bmatrix} 1 & {- 1} & 1 & {- 1} \\ 1 & 1 & {- 1} & {- 1} \\ {- 1} & 1 & 1 & {- 1} \\ 1 & 1 & 1 & 1 \end{bmatrix}.}}$

In order to transmit a total of 8 bits for each Tx data stream, one BPSK symbol for each antenna may be transmitted during the time slot (M_(T)=8). Each element of the codebooks (χ_(QAM,QOSTBC), χ_(G-STBC)) nay be denoted by a (4×1) vector. Each element of one vector may be set to one of 2 BPSK signals. Therefore, each codebook (χ_(QAM,QOSTBC),χ_(G-STBC)) may have a total number (M^(M) ^(T) ^(/2)=2⁴=16) of the (4×1) codeword vectors, such that the total of (M^(M) ^(T) ^(/2)=2⁴=16) (4×1) codeword vectors may serve as the element. χ_(QAM,QOSTBC) and χ_(G-STBC) may be represented as follows. χ_(QAM,QOSTBC) ={s[1],s[2], . . . ,s[16]}, s _(n) [k]ε{−1,+1} Parameter range: kε{1,2, . . . ,16}, nε{1,2, . . . 4} χ_(G-STBC) =TD×χ _(QAM,QOSTBC) ={S[1],S[2], . . ,S[16]}

The amount of information applied to the Tx antenna index sequence is a total of 2 bits, and the Tx antenna index sequence and the binary signal thereto may be defined as follows. χ_(Ant)={I₁,I₂,I₃,I₄,u₁,u₂,u₃,u₄} I₁=(1,2), (3,4), (5,6), (7,8), I₂=(1,3), (2,4), (5,7), (6,8) I₃=(1,4), (2,5), (3,8), (6,7), I₄=(1,5), (2,6), (3,7), (4,8) u₁=[0,0],u₂=[0,1],u₃=[1,0],u₄=[1,1]

The effective channel matrix codebook χ_(H)={

,

,

,

} corresponding to χ_(Ant)={I₁,I₂,I₃,I₄,u₁,u₂,u₃,u₄} is as follows.

1 = [ h 1 h 2 - h 2 * h 1 * h 3 h 4 - h 4 * h 3 * h 5 h 6 - h 6 * h 5 * h 7 h 8 - h 8 * h 7 * ] , 2 = [ h 1 h 3 0 0 0 0 0 0 h 2 h 4 ⋮ - h 3 * h 1 * 0 0 ⋮ ⋮ 0 0 - h 4 * h 2 * 0 0 … 0 ⋮ ⋮ 0 0 h 5 h 7 * 0 0 0 0 h 6 h 8 - h 7 * h 5 * 0 0 0 0 … 0 0 0 - h 8 * h 6 * ] 3 = [ h 1 h 4 h 2 h 5 h 3 h 8 - h 4 * h 1 * - h 5 * h 2 * h 6 h 7 - h 7 * h 6 * - h 8 * h 3 * ] , 4 = [ h 1 h 5 h 2 h 6 h 3 h 7 h 4 h 8 - h 5 * h 1 * - h 6 * h 2 * - h 7 * h 3 * - h 8 * h 4 * ]

Assuming that the k-the symbol vector S[k]εχ_(G-STBC) is transmitted using the sequence (I₂) and the reception noise is omitted, Equation 23 may also be represented by the following equation 30. {tilde over (y)} _(j)=

×S[k],  [Equation 30] where jε{1,2,3,4}, kε{1,2, . . . ,16}

Specifically,

for use in {tilde over (y)}₂=

×S[k] may have the following equation 31.

[ Equation ⁢ ⁢ 31 ] 2 H ⁢ ⁢ 2 = [ ⁢ ( h 1 ⁢ h 1 * + h 3 ⁢ h 3 * ) ⁢ I 2 ( h 2 ⁢ h 2 * + h 4 ⁢ h 4 * ) ⁢ I 2 ( h 5 ⁢ h 5 * + h 7 ⁢ h 7 * ) ⁢ I 2 ( h 6 ⁢ h 6 * + h 8 ⁢ h 8 * ) ⁢ I 2 ⁢ ]

In Equations 25 and 26, the parameters (a₂,b₂,c₂,d₂) corresponding to (j=2) may be a₂=h₁h*₁+h₃h*₃, b₂=h₂h*₂+h₄h*₄, c₂=h₅h*₅+h₇h*₇, d₂=h₆h*₆+h₈h*₈, respectively. Even when

(where j=1,3,4) is used, the above parameters may be derived in the same manner as described above.

The matrices (

,

,

) corresponding to the product of the effective channel (

) of the sequence (I₂) and a transpose matrix of a channel matrix corresponding to another sequence are not denoted by diagonal matrices. Although the odd and even elements of the resultant value {tilde over (y)}_(j) obtained when the transpose matrix of the j-th element of the codebook (χ_(H)) is multiplied by the Rx signal are decoded in different ways, if no noise occurs, a desired Tx symbol vector and the effective channel matrix corresponding to the used sequence can always be searched for. Therefore, {tilde over (y)}_(j) is divided into {tilde over (y)}_(j) ^(Even),{tilde over (y)}_(j) ^(Odd) as shown in the following equation 32, and {tilde over (y)}_(j) ^(Even),{tilde over (y)}_(j) ^(Odd) may be decoded in different ways.

$\begin{matrix} {{{\overset{\sim}{y}}_{j}^{Even} = \begin{bmatrix} {\overset{\sim}{y}}_{j,2} \\ \vdots \\ {\overset{\sim}{y}}_{j,8} \end{bmatrix}},{{\overset{\sim}{y}}_{j}^{Odd} = \begin{bmatrix} {\overset{\sim}{y}}_{j,1} \\ \vdots \\ {\overset{\sim}{y}}_{j,7} \end{bmatrix}},{where},{j \in \left\{ {1,2,3,4} \right\}}} & \left\lbrack {{Equation}\mspace{14mu} 32} \right\rbrack \end{matrix}$

As can be seen from Equations 25 to 27, d_(Even) ^([k,j]) and d_(Odd) ^([k,j]) may be searched for, and the Tx symbol vector and the Tx antenna index sequence may be determined using the following equation 33.

$\begin{matrix} {\left( {k^{*},j^{*}} \right) = {\arg\underset{{\forall k},{\forall j}}{\;\min}\left( {d_{Even}^{\lbrack{k,j}\rbrack} + d_{odd}^{\lbrack{k,j}\rbrack}} \right)}} & \left\lbrack {{Equation}\mspace{14mu} 33} \right\rbrack \end{matrix}$

A detailed description of the receiver having lower calculation complexity than the receiver of FIG. 6 will hereinafter be given.

FIG. 7 is a block diagram illustrating a receiver according to another embodiment of the present invention.

The receiver shown in FIG. 6 simultaneously searches for all QO-STBC symbols and all antenna index sequences. If many antennas are present and the modulation order is very high, the complexity may excessively increase. As a result, the low complexity Rx scheme for sequentially searching for antenna indexes two by two may be considered and used.

As can be seen from Equation 25, Equation 26, and Equation 31, although the effective channel matrix (

) is not denoted by the block diagonal matrix,

may be diagonal matrices. Accordingly, one antenna index pair may be decided on the basis of two timeslots. In FIG. 7, the Rx symbol vector may be represented by the following equation 34 according to the symbol reception (Rx) time. t=(1,2),(3,4), . . . ,(M _(T)−1,M _(T)), y(1,2),y(3,4), . . . , y(M _(T)−1,M _(T))

First, the codebook χ_(G-STBC) may be used to search for the pair of antenna indexes. The QAM symbol defined in the codebook χ_(QAM,QOSTBC) of Equation 13 may be decoded as long as M_(T)/2 GBD-QOSTBC symbols, and the inverse matrix of the matrix (TD) of Equation 14 is multiplied by the decoded result, such that it may be search for the QAM symbol using the multiplication result. Therefore, after the antenna index sequence is determined on the basis of χ_(G-STBC) according to the Rx scheme of the present invention, it may be search for χ_(QAM,QOSTBC). For convenience of description, four antenna index sequences of Equation 35 may be considered and used.

$\begin{matrix} \begin{matrix} {{t = \left( {1,2} \right)},\left( {3,4} \right),\ldots\mspace{14mu},\left( {{M_{T} - 1},M_{T}} \right)} \\ {{{I_{1}(00)} = \left( {1,2} \right)},\left( {3,4} \right),\left( {5,6} \right),\left( {7,8} \right)} \\ {{{I_{2}(01)} = \left( {1,3} \right)},\left( {2,4} \right),\left( {5,7} \right),\left( {6,8} \right)} \\ {{{I_{3}(10)} = \left( {1,4} \right)},\left( {2,5} \right),\left( {3,8} \right),\left( {6,7} \right)} \\ {{{I_{4}(11)} = \left( {1,5} \right)},\left( {2,6} \right),\left( {3,7} \right),\left( {4,8} \right)} \end{matrix} & \left\lbrack {{Equation}\mspace{14mu} 35} \right\rbrack \end{matrix}$

The antenna index pairs capable of being used at the condition (t=1,2) may be limited to (1,2), (1,3), (1,4), (1,5). Therefore, only four combinations may be considered and used at t=1,2. The same results may be acquired not only at t=3,4 but also at the subsequent timeslots located after t=3,4. Assuming that the k-th symbol vector of χ_(G-STBC) is transmitted at t=1,2 and the antenna indexes (1,3) are then selected, two GBD-QOSTBC symbols may be (h₁h*₁+h₃h*₃)(S₁[k],S₂[k]), respectively. If there is no influence of interference, the GBD-QOSTBC symbol can always be searched for.

As can be seen from Equation 14, since only S₁[k] and S₂[k] can be transmitted at t=1,2,S_(j)[k],j≧3 is not considered at t=1,2. The same principle as in the above case may be used even at t=3,4, so that only S_(j)[k],j=3,4 of the codebook (χ_(G-STBC)) may be used in the above searching process. As a result, although the GBD-QOSTBC symbol and the antenna index are simultaneously searched for, this searching process is performed on the basis of 2 Alamouti blocks, instead of using the method for searching for all sequences, such that the above-mentioned method may have lower calculation complexity than the joint-ML scheme.

In summary, the legacy GBD-QOSTBC structure is modified in a manner that the sequence composed of the Tx antenna indexes may be constructed and the binary data sequence may be allocated to the resultant antenna sequence, such that some parts of data to be loaded on the Tx symbols (i.e., QAM and PSK modulation symbols) and then transmitted can be allocated to the antenna sequence. Accordingly, reduction of a minimum length between symbols can be prevented when the modulation order increases, so that an improved BER performance superior to that of the GBD-QOSTBC scheme can be provided to the SNR region of a predetermined level or higher.

Whereas the legacy STBC-SM scheme must unavoidably accept the diversity performance deterioration instead of obtaining the SM gain when the data stream is transmitted, the proposed scheme of the present invention loads data on the Tx antenna sequence and then transmits the resultant Tx antenna sequence, without loss of a maximum amount of the diversity gain that is capable of being obtained by the QO-STBC scheme, such that a gain similar to that of the SM-MIMO scheme can be obtained.

As is apparent from the above description, the embodiments of the present invention can more effectively transmit data in a MIMO wireless communication system.

It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the spirit or scope of the inventions. Thus, it is intended that the present invention covers the modifications and variations of this invention provided they come within the scope of the appended claims and their equivalents. 

What is claimed is:
 1. A method for transmitting a signal to a receiver by a transmitter in a multiple input multiple output (MIMO) wireless communication system, comprising: generating a bit stream having a size of specific bits through channel coding of data; dividing the bit stream into a first bit stream having a first bit size and a second bit stream having a second bit size; allocating the second bit stream having the second bit size to an antenna sequence codeword selected from a plurality of antenna sequence codewords based on a signal transmission time, wherein the antenna sequence codeword comprises indexes of a plurality pair of antenna ports not overlapped with each other and indexes of each pair of antenna ports indicates one bit of the second bit stream; and transmitting the first bit stream having the first bit size to the receiver using the plurality of pair of antenna ports according to an order of antenna pairs indicated by the allocated antenna sequence codeword.
 2. The method according to claim 1, wherein the antenna sequence codeword is defined by 2 timeslots and 2 antenna indexes.
 3. The method according to claim 1, wherein the transmitting the first bit stream having the first bit size includes: transmitting the first bit stream having the first bit size using QO (quasi-orthogonal)-STBC (space time block code), according to the order of antenna pairs indicated by the allocated antenna sequence codeword, on a timeslot basis.
 4. The method according to claim 3, wherein the allocated antenna sequence codeword indicates a pair of antennas needed to transmit data during 2 timeslots.
 5. The method according to claim 1, wherein the sum of the first bit size and the second bit size is identical to the specific bit size. 